Matching of Order-Sorted Terms with Regular Expression Sorts and Second-Order Variables
نویسندگان
چکیده
We construct a sound and complete matching procedure for order-sorted terms with regular expression sorts and second-order variables. Since the theory is infinitary, there are matching problems on which the procedure does not terminate. Restricting the rules of the procedure, we obtain an incomplete terminating algorithm and give some examples of its possible applications in source code searching.
منابع مشابه
Regular expression order-sorted unification and matching
We extend order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The obtained signature corresponds to a finite bottom-up unranked tree automaton. We prove that regular expression order-sorted (REOS) unification is of type infinitary and decidable. The unification problem presented by us generalizes some known problems, such as, e.g...
متن کاملOrder-Sorted Unification with Regular Expression Sorts
We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is finite. The corresponding unification problem is infinitary. We conjecture that this unification problem is decidable and give a complete unification procedure.
متن کاملUniication in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading
We develop an order-sorted higher-order calculus suitable for automatic theorem proving applications by extending the extensional simply typed lambda calculus with a higher-order ordered sort concept and constant overloading. Huet's well-known techniques for unifying simply typed lambda terms are generalized to arrive at a complete transformation-based uniication algorithm for this sorted calcu...
متن کاملCompletion of Rewrite Systems with Membership Constraints. Part I: Deduction Rules
We consider a constrained equational logic where the constraints are membership conditions t 2 s where s is interpreted as a regular tree language. Our logic includes a fragment of second order equational logic (without projections) where second order variables range over regular sets of contexts. The problem with constrained equational logics is the failure of the critical pair lemma. That is ...
متن کاملPartial second-order subdifferentials of -prox-regular functions
Although prox-regular functions in general are nonconvex, they possess properties that one would expect to find in convex or lowerC2 functions. The class of prox-regular functions covers all convex functions, lower C2 functions and strongly amenable functions. At first, these functions have been identified in finite dimension using proximal subdifferential. Then, the definition of prox-regula...
متن کامل